算法（九）贪心算法之排队问题

题目描述：

Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of this person who have a height greater than or equal to h. Write an algorithm to reconstruct the queue.

Note:
The number of people is less than 1,100.

Example

Input:
[[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]

Output:
[[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]

解题思路：

1. 从身高最矮的人开始。对传进来的数据进行排序，矮的在前，身高一样的话就比他高的人多的排在前面，然后对这个数据容器（vector）进行遍历。开辟一个空间重新存储这个队列。每次遍历容器的一个元素，则这个元素在新队列的位置由这个元素的第二个参数（比他高的人的数目）决定，这个数字是多少则在他前面应当刚好有这个数字的空位。如此遍历下来刚好能填满新空间。代码如下：

   struct person {
       int height;
       int heighterPeople;
       int flag;
       person() {
           flag = 0;//这个位置是否为空
           height = 0;
           heighterPeople = 0